Capybara: equivalence ClAss enumeration of coPhylogenY event-BAsed ReconciliAtions
نویسندگان
چکیده
منابع مشابه
State/Event Net Equivalence
The paper is concerned with P/T nets with labeled and unlabeled places and transitions. An equivalence relation is deened for such nets, which abstracts from unlabeled nodes, generalizes place bisimilarity, preserves their branching structure and is a congruence for merge, relabeling, synchronization and reenement. The relation becomes a state-oriented one when all transitions are unlabeled and...
متن کاملEquivalence Class Subset Algorithm
The equivalence class subset algorithm is a powerful tool for solving a wide variety of constraint satisfaction problems and is based on the use of a decision function which has a very high but not perfect accuracy. Perfect accuracy is not required in the decision function as even a suboptimal solution contains valuable information that can be used to help find an optimal solution. In the harde...
متن کاملProving Class Equivalence
We present a sound and complete method for reasoning about contextual equivalence between different implementations of classes in an imperative subset of Java. Our technique successfully deals with public and private methods and fields, imperative fields, inheritance, and invocations of callbacks. To the extent of our knowledge this is the first sound and complete proof method of equivalence be...
متن کاملVisualizing Co-phylogenetic Reconciliations
We introduce a hybrid metaphor for the visualization of the reconciliations of co-phylogenetic trees, that are mappings among the nodes of two trees. The typical application is the visualization of the co-evolution of hosts and parasites in biology. Our strategy combines a space-filling and a node-link approach. Differently from traditional methods, it guarantees an unambiguous and ‘downward’ r...
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2020
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btaa498